Value : 99 Cache State : Shared Cache Value : 99 Cache State : Invalid Cache Value : XX Cache State : Invalid Cache Value : XX
نویسنده
چکیده
A fundamental diiculty in automatic formal veriication of nite-state systems is the state explosion problem { even relatively simple systems can produce very large state spaces, causing great dii-culties for methods that rely on explicit state enumeration. We address the problem by exploiting structural symmetries in the description of the system to be veriied. We make symmetries easy to detect by introducing a new data type scalarset, a nite and unordered set, to our description language. The operations on scalarsets are restricted so that states are guaranteed to have the same future behaviors, up to permutation of the elements of the scalarsets. Using the symmetries implied by scalarsets, a veriier can automatically generate a reduced state space, on the y. We provide a proof of the soundness of the new symmetry-based veriication algorithm based on a deenition of the formal semantics of a simple description language with scalarsets. The algorithm has been implemented and evaluated on several realistic high-level designs. Memory requirements were reduced by amounts ranging from 83% to over 99%, with speedups ranging from 65% to 98%. Symmetry-based reduction leads to an alternative characterization of data independence: a protocol is data-independent if there is a scalarset type not used as an array index or for loop index. In this case, symmetry-based reduction converts an innnite state space to a nite state space. Unlike other methods that exploit data independence in veriication, this reduction occurs completely automatically.
منابع مشابه
Reduction in Cache Memory Power Consumption based on Replacement Quantity
Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in cache memories. There is a direct relationship between power consumption and replacement quantity made in cache. The less the number of replacements is, the less...
متن کاملReduction in Cache Memory Power Consumption based on Replacement Quantity
Today power consumption is considered to be one of the important issues. Therefore, its reduction plays a considerable role in developing systems. Previous studies have shown that approximately 50% of total power consumption is used in cache memories. There is a direct relationship between power consumption and replacement quantity made in cache. The less the number of replacements is, the less...
متن کاملReliability Tradeoffs in Design of Cache Memories
Cache memory is a fundamental component of all modern microprocessors. Caches provide for efficient read/write access to memory, and their reliability is essential to assure dependable computing. Errors that occur in the cache can corrupt data values or result in invalid state, and can easily propagate throughout the system to cause data integrity issues. One of the main threats to cache reliab...
متن کاملThe E ect of Using State { Based Priority Information in aShared {
The cache replacement policy is one of the factors that determines the eeectiveness of cache memories. In this paper, we study the impact of incorporating the cache block coherence state information in the Random replacement policy in a shared{memory multipro-cessor. We assign replacement priority to each cache block within a set based on its state. To reduce the probability of replacing a rece...
متن کامل